A survey on the computation of quaternions from rotation matrices

The parameterization of rotations is a central topic in many theoretical and applied fields such as rigid body mechanics, multibody dynamics, robotics, spacecraft attitude dynamics, navigation, 3D image processing, computer graphics, etc. Nowadays, the main alternative to the use of rotation matrices, to represent rotations in R3, is the use of Euler parameters arranged in quaternion form. Whereas the passage from a set of Euler parameters to the corresponding rotation matrix is unique and straightforward, the passage from a rotation matrix to its corresponding Euler parameters has been revealed to be somewhat tricky if numerical aspects are considered. Since the map from quaternions to 3x3 rotation matrices is a 2-to-1 covering map, this map cannot be smoothly inverted. As a consequence, it is erroneously assumed that all inversions should necessarily contain singularities that arise in the form of quotients where the divisor can be arbitrarily small. This misconception is herein clarified. This paper reviews the most representative methods available in the literature, including a comparative analysis of their computational costs and error performances. The presented analysis leads to the conclusion that Cayley's factorization, a little-known method used to compute the double quaternion representation of rotations in four dimensions from 4x4 rotation matrices, is the most robust method when particularized to three dimensionsPreprin

Minimal cosmography

The minimal requirement for cosmography - a nondynamical description of the universe - is a prescription for calculating null geodesics, and timelike geodesics as a function of their proper time. In this paper, we consider the most general linear connection compatible with homogeneity and isotropy, but not necessarily with a metric. A light-cone structure is assigned by choosing a set of geodesics representing light rays. This defines a "scale factor" and a local notion of distance, as that travelled by light in a given proper time interval. We find that the velocities and relativistic energies of free-falling bodies decrease in time as a consequence of cosmic expansion, but at a rate that can be different than that dictated by the usual metric framework. By extrapolating this behavior to photons redshift, we find that the latter is in principle independent of the "scale factor". Interestingly, redshift-distance relations and other standard geometric observables are modified in this extended framework, in a way that could be experimentally tested. An extremely tight constraint on the model, however, is represented by the blackbody-ness of the Cosmic Microwave Background. Finally, as a check, we also consider the effects of a non-metric connection in a different set-up, namely, that of a static, spherically symmetric spacetime.Comment: 13 pages. v2: improved version to appear on Gen. Rel. and Gra

Yet another approach to the Gough-Stewart platform forward kinematics

© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The forward kinematics of the Gough-Stewart platform, and their simplified versions in which some leg endpoints coalesce, has been typically solved using variable elimination methods. In this paper, we cast doubts on whether this is the easiest way to solve the problem. We will see how the indirect approach in which the length of some extra virtual legs is first computed leads to important simplifications. In particular, we provide a procedure to solve 30 out of 34 possible topologies for a Gough-Stewart platform without variable elimination.Peer ReviewedPostprint (author's final draft

Geometric path planning without maneuvers for nonholonomic parallel orienting robots

Current geometric path planners for nonholonomic parallel orienting robots generate maneuvers consisting of a sequence of moves connected by zero-velocity points. The need for these maneuvers restrains the use of this kind of parallel robots to few applications. Based on a rather old result on linear time-varying systems, this letter shows that there are infinitely differentiable paths connecting two arbitrary points in SO(3) such that the instantaneous axis of rotation along the path rest on a fixed plane. This theoretical result leads to a practical path planner for nonholonomic parallel orienting robots that generates single-move maneuvers. To present this result, we start with a path planner based on three-move maneuvers, and then we proceed by progressively reducing the number of moves to one, thus providing a unified treatment with respect to previous geometric path planners.Peer ReviewedPostprint (author's final draft

Singularity-invariant leg substitutions in pentapods

6 páginas, 5 figuras, 4 tablas.-- Trabajo presentado a la IROS 2010 celebrada en Taipei (Taiwan) del 18 al 22 de Octubre.A pentapod is usually defined as a 5-degree-of-freedom fully-parallel manipulator with an axial spindle as moving platform. This kind of manipulators have revealed as an interesting alternative to serial robots handling axisymmetric tools. Their particular geometry permits that, in one tool axis, inclination angles of up to 90 degrees are possible thus overcoming the orientation limits of the classical Stewart platform.This work has been partially supported by the Spanish Ministry of Education and Innovation, under the I+D project DPI2007-60858.Peer reviewe

Shape-from-image via cross-sections

International Conference on Pattern Recognition (ICPR), 2000, Barcelona (España)Using structural geometry, Whiteley (1991) showed that a line drawing is a correct projection of a spherical polyhedron if and only if it has a cross-section compatible with it. We extend the class of drawings to which this test applies, including those of polyhedral disks. Our proof is constructive, showing how to derive all spatial interpretations; it relies on elementary synthetic geometric arguments, and, as a by-product, it yields a simpler and shorter proof of Whiteley's result. Moreover, important properties of line drawings are visually derived as corollaries: realizability is independent of the adopted projection, it is an invariant projective property, and for trihedral drawings it can be checked with a pencil and an unmarked ruler alone.Peer Reviewe

Grasping unknown objects in clutter by superquadric representation

© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, a quick and efficient method is presented for grasping unknown objects in clutter. The grasping method relies on real-time superquadric (SQ) representation of partial view objects and incomplete object modelling, well suited for unknown symmetric objects in cluttered scenarios which is followed by optimized antipodal grasping. The incomplete object models are processed through a mirroring algorithm that assumes symmetry to first create an approximate complete model and then fit for SQ representation. The grasping algorithm is designed for maximum force balance and stability, taking advantage of the quick retrieval of dimension and surface curvature information from the SQ parameters. The pose of the SQs with respect to the direction of gravity is calculated and used together with the parameters of the SQs and specification of the gripper, to select the best direction of approach and contact points. The SQ fitting method has been tested on custom datasets containing objects in isolation as well as in clutter. The grasping algorithm is evaluated on a PR2 robot and real time results are presented. Initial results indicate that though the method is based on simplistic shape information, it outperforms other learning based grasping algorithms that also work in clutter in terms of time-efficiency and accuracy.Peer ReviewedPostprint (author's final draft

Singularity-free computation of quaternions from rotation matrices in E4 and E3

A real orthogonal matrix representing a rotation in E4 can be decomposed into the commutative product of a left-isoclinic and a right-isoclinic rotation matrix. The double quaternion representation of rotations in E4 follows directly from this decomposition. In this paper, it is shown how this decomposition can be performed without divisions. This avoids the common numerical issues attributed to the computation of quaternions from rotation matrices. The map from the 4×4 rotation matrices to the set of double unit quaternions is a 2-to-1 covering map. Thus, this map cannot be smoothly inverted. As a consequence, it is erroneously assumed that all inversions should necessarily contain singularities that arise in the form of quotients where the divisor can be arbitrarily small. This misconception is herein clari¿ed. When particularized to three dimensions, it is shown how the resulting formulation outperforms, from the numerical point of view, the celebrated Shepperd’s method.Peer ReviewedPostprint (author's final draft

On Cayley's factorization with an application to the orthonormalization of noisy rotation matrices

The final publication is available at link.springer.comA real orthogonal matrix representing a rotation in four dimensions can be decomposed into the commutative product of a left- and a right-isoclinic rotation matrix. This operation, known as Cayley's factorization, directly provides the double quaternion representation of rotations in four dimensions. This factorization can be performed without divisions, thus avoiding the common numerical issues attributed to the computation of quaternions from rotation matrices. In this paper, it is shown how this result is particularly useful, when particularized to three dimensions, to re-orthonormalize a noisy rotation matrix by converting it to quaternion form and then obtaining back the corresponding proper rotation matrix. This re-orthonormalization method is commonly implemented using the Shepperd-Markley method, but the method derived here is shown to outperform it by returning results closer to those obtained using the Singular Value Decomposition which are known to be optimal in terms of the Frobenius norm.Peer ReviewedPostprint (author's final draft